from math import sqrt

def isPrime(x):
    for i in range(2,int(sqrt(x)+1)):
        if x%i == 0:
            return False
    return True

n=int(input())
if isPrime(n):
    print('y')
else:
    print('n')